The 7/5-conjecture strengthens itself
نویسنده
چکیده
The following is proved: if every bridgeless graph G has a cycle cover of length at most 7/51€(G)I, then every bridgeless graph G has a cycle cover of length at most 7/51€(G)I such that any edge of G is covered once or twice.
منابع مشابه
Cartesian powers of graphs can be distinguished by two labels
1 The distinguishing number D(G) of a graph G is the least integer d such that there is a d-labeling 2 of the vertices of G which is not preserved by any nontrivial automorphism. For a graph G let Gr 3 be the r th power of G with respect to the Cartesian product. It is proved that D(Gr ) = 2 for any 4 connected graph G with at least 3 vertices and for any r ≥ 3. This confirms and strengthens a ...
متن کاملOn some generalisations of Brown's conjecture
Let $P$ be a complex polynomial of the form $P(z)=zdisplaystyleprod_{k=1}^{n-1}(z-z_{k})$,where $|z_k|ge 1,1le kle n-1$ then $ P^prime(z)ne 0$. If $|z|
متن کاملCluster expansion and the boxdot conjecture
The boxdot conjecture asserts that every normal modal logic that faithfully interprets T by the well-known boxdot translation is in fact included in T. We confirm that the conjecture is true. More generally, we present a simple semantic condition on modal logics L0 which ensures that the largest logic where L0 embeds faithfully by the boxdot translation is L0 itself. In particular, this natural...
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملAN APPLICATION OF SCHLÀFLPS MODULAR EQUATION TO A CONJECTURE OF RAMANUJANf
In 1918 RamanujanJ made the following conjecture: If ç = 5, 7, or 11, and if 24^ — 1 is divisible by q, then the number p(n) of unrestricted partitions of n is divisible by q. Ramanujan himself proved this conjecture to be true in casej q = S, 7, 5, and 7, and also§ for q=ll and l l 2 . It has since been proved|| for q = 5. Some modification of the conjecture is necessary, however, since, as Ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 19 شماره
صفحات -
تاریخ انتشار 1995